A Map%2DReduce System with an Alternate API for Multi%2Dcore Environments.

Privacy%2DPreserving Location Publishing under Road%2DNetwork Constraints.


A generalized control%2Dflow%2Daware pattern recognition algorithm for behavioral synthesis.
ABSTRACT — Pattern recognition has many applications in design automation. A generalized pattern recognition algorithm is presented in this paper which can efficiently extract similar patterns in programs. Compared to previous pattern-based techniques, our approach overcomes their limitation in handling control-flow-aware patterns, and leads to more opportunities for optimization. Our algorithm uses a feature-based filtering approach for fast pruning, and an elegant graph similarity metric called the generalized edit distance for measuring variations in CDFGs. Furthermore, our pattern recognition algorithm is applied to solve the area optimization problem in behavioral synthesis. Our experimental results show up to a 40 % area reduction on a set of real-world benchmarks with a moderate 9 % latency overhead, compared to synthesis results without pattern extractions; and up to a 30 % area reduction, compared to the results using only data-flow patterns.

Accelerating Monte Carlo based SSTA using FPGA.
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we accelerate Monte Carlo based SSTA using the FPGA platform. A simple dataflow pipeline technique will not work well due to the excessive usage of FPGA logic slices. We leverage the recently proposed pattern matching method to identify common circuit structures, and further use a mathematical programming based formulation to explore the trade-off between performance and logic slices consumption. The proposed design provides two orders of magnitude speedup compared to the CPU-based implementation.
Automatic aesthetic value assessment in photographic images.

An economic early warning approach based on Bayesian Networks mechanism%3F


QSynth A Tool for QoS%2Daware Automatic Service Composition.


A framework of irregularity enlightenment for data pre%2Dprocessing in data mining.

Adjusted support vector machines based on a new loss function.

Approximate solution of the fractional advection%2Ddispersion equation.

A thick%2Drestarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems.

Panoramic 3D Reconstruction Using Stereo Multi%2DPerspective Panorama.

Solving nonlinear singular pseudoparabolic equations with nonlocal mixed conditions in the reproducing kernel space.

A dynamic collision model for improved over%2Drange protection of cantilever%2Dmass micromechanical accelerometers.

Sketch%2DBased 3D Face Modeling for Virtual Character.

Audio%2Dvisual atoms for generic video concept classification.
We investigate the challenging issue of joint audio-visual analysis of generic videos targeting at semantic concept detection. We propose to extract a novel representation, the Short-term Audio-Visual Atom (S-AVA), for improved concept detection. An S-AVA is defined as a short-term region track associated with regional visual features and background audio features. An effective algorithm, named Short-Term Region tracking with joint Point Tracking and Region Segmentation (STR-PTRS), is developed to extract S-AVAs from generic videos under challenging conditions such as uneven lighting, clutter, occlusions, and complicated motions of both objects and camera. Discriminative audio-visual codebooks are constructed on top of S-AVAs using Multiple Instance Learning. Codebook-based features are generated for semantic concept detection. We extensively evaluate our algorithm over Kodak’s consumer benchmark video set from real users. Experimental results confirm significant performance improvements – over 120 % MAP gain compared to alternative approaches using static region segmentation without temporal tracking. The joint audio-visual features also outperform visual features alone by an average of 8.5 % (in terms of AP) over 21 concepts, with many concepts achieving more than 20%.
Efficient privacy%2Dpreserving similar document detection.

Privacy
Each of two parties PX and P Y holds an n-bit input, x and y, respectively. They wish to privately compute the value of f(x; y). That is, PX should not learn any additional information about y (in the information-theoretic sense) other than what follows from its input x and the function value, f(x; y), and similarly, P Y should not learn any additional information about x.  In this paper we consider two basic questions in the theory of private computations: 1. Which functions can be privately computed ? 2. What is the communication complexity of protocols that privately compute a function  f (in the case that such protocols exist) ? A complete combinatorial characterization of privately computable functions is given. We use this characterization to derive tight bounds on the rounds complexity of any privately computable function, and to design optimal private protocols that compute these functions. We show that for every 1  g(n)  2 \Delta 2  n  there are functions that can be privately...
Single%2DCamera Multi%2Dbaseline Stereo Using Fish%2DEye Lens and Mirrors.

Disparity Estimation in a Layered Image for Reflection Stereo.

Short%2Dterm audio%2Dvisual atoms for generic video concept classification.
We investigate the challenging issue of joint audio-visual analysis of generic videos targeting at semantic concept detection. We propose to extract a novel representation, the Short-term Audio-Visual Atom (S-AVA), for improved concept detection. An S-AVA is defined as a short-term region track associated with regional visual features and background audio features. An effective algorithm, named Short-Term Region tracking with joint Point Tracking and Region Segmentation (STR-PTRS), is developed to extract S-AVAs from generic videos under challenging conditions such as uneven lighting, clutter, occlusions, and complicated motions of both objects and camera. Discriminative audio-visual codebooks are constructed on top of S-AVAs using Multiple Instance Learning. Codebook-based features are generated for semantic concept detection. We extensively evaluate our algorithm over Kodak’s consumer benchmark video set from real users. Experimental results confirm significant performance improvements – over 120 % MAP gain compared to alternative approaches using static region segmentation without temporal tracking. The joint audio-visual features also outperform visual features alone by an average of 8.5 % (in terms of AP) over 21 concepts, with many concepts achieving more than 20%.
Location sensitive indexing for image%2Dbased advertising.

Effective Pruning Algorithm for QoS%2DAware Service Composition.

Comparing map%2Dreduce and FREERIDE for data%2Dintensive applications.

t%2DPlausibility Semantic Preserving Text Sanitization.
Text documents play significant roles in decision making and scientific research. Under federal regulations, documents (e.g., pathology records) containing personally identifiable information cannot be shared freely, unless properly sanitized. Generally speaking, document sanitization consists of finding and hiding personally identifiable information. The first task has received much attention from the research community, but the main strategy for the second task has been to simply remove personal identifiers. It is not hard to see that if important information (e.g., diagnoses and personal medical histories) is completely removed from pathology records, these records are no longer readable, and even worse, they no longer contain sufficient information for research purposes. Observe that the sensitive information “tuberculosis ” can be replaced with the less sensitive term “infectious disease”. That is, instead of simply removing sensitive terms, these terms can be hidden by more general but semantically related terms to protect sensitive information, without unnecessarily degrading the amount of information contained in the document. Based on this observation, the main contribution of this paper is to provide a novel information theoretic approach to text sanitization, develop efficient heuristics to sanitize text documents, and analyze possible attacks preventable under the proposed model. 1.
Efficiency of Winnow Protocol in Secret Key Reconciliation.

An Implementation of Post%2DProcessing Software in Quantum Key Distribution.

Monitoring and Forecast Method of Mine External Fire.

Visual saliency with side information.

An online advertisement platform based on image content bidding.

Automatic memory partitioning and scheduling for throughput and power optimization.
Hardware acceleration is crucial in modern embedded system design to meet the explosive demands on performance and cost. Selected computation kernels for acceleration are usually captured by nest loops, which are optimized by state-of-the-art techniques like loop tiling and loop pipelining. However, memory bandwidth bottlenecks prevent designs to reach optimal throughput with respect to available parallelism. In this paper we present an automatic memory partitioning technique which can efficiently improve throughput and reduce energy consumption of pipelined loop kernels for given throughput constraints and platform requirement. Our partition scheme consists of two steps, the first step considers cycle accurate scheduling information to meet the hard constraints on memory bandwidth requirements specifically for synchronized hardware designs. Experimental results show an average 6X throughput improvement on a set of real world designs with moderate area increase (about 45 % on average), given that less resource sharing opportunities exist with higher throughput in optimized designs. The second step further partitions the memory banks for reducing the dynamic power consumption of the final design. In contrast with previous approaches, our technique can statically compute memory access frequencies in polynomial time with little to none profiling. Experimental results show about 30% power reduction on the same set of benchmarks.
An online advertisement platform based on image content bidding.

Visiads A vision%2Dbased advertising platform for camera phones.

Optimal Network Security Strengthening Using Attack%2DDefense Game Model.

Fairness and Interactivity of Three CPU Schedulers in Linux.

Compatibility Checking of Heterogeneous Web Service Policies Using VDM  .

Compatibility Checking of Heterogeneous Web Service Policies Using VDM  .

Constructive proof for existence of nonlinear two%2Dpoint boundary value problems.

Parallelization and optimization of electrostatic Particle%2Din%2DCell%2FMonte%2DCarlo Coupled codes as applied to RF discharges.


Formal anonymity models for efficient privacy%2Dpreserving joins.


Principle of designing slope compensation in PFC Boost converter.

Scheduling with integer time budgeting for low%2Dpower optimization.

Guidelines to Determine Quality for Web%2DBased Software Applications.

Relevance aggregation projections for image retrieval.

Semantic Concept Classification by Joint Semi%2Dsupervised Learning of Feature Subspaces and Support Vector Machines.
Abstract. The scarcity of labeled training data relative to the highdimensionality multi-modal features is one of the major obstacles for semantic concept classification of images and videos. Semi-supervised learning leverages the large amount of unlabeled data in developing effective classifiers. Feature subspace learning finds optimal feature subspaces for representing data and helping classification. In this paper, we present a novel algorithm, Locality Preserving Semi-supervised Support Vector Machines (LPSSVM), to jointly learn an optimal feature subspace as well as a large margin SVM classifier. Over both labeled and unlabeled data, an optimal feature subspace is learned that can maintain the smoothness of local neighborhoods as well as being discriminative for classification. Simultaneously, an SVM classifier is optimized in the learned feature subspace to have large margin. The resulting classifier can be readily used to handle unseen test data. Additionally, we show that the LPSSVM algorithm can be used in a Reproducing Kernel Hilbert Space for nonlinear classification. We extensively evaluate the proposed algorithm over four types of data sets: a toy problem, two UCI data sets, the Caltech 101 data set for image classification, and the challenging Kodak’s consumer video data set for semantic concept detection. Promising results are obtained which clearly confirm the effectiveness of the proposed method. 1
Pattern%2Dbased behavior synthesis for FPGA resource reduction.
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general pattern-based behavior synthesis framework which can efficiently extract similar structures in programs. Our approach is very scalable in benefit of advanced pruning techniques that include locality sensitive hashing and characteristic vectors. The similarity of structures is captured by a mismatch-tolerant metric: graph edit distance. The edit distance between two graphs is the minimum number of vertex/edge insertion, deletion, substitution operations to transform one graph into the other. Graph edit distance can naturally handle various program variations such as bit-width, structure, and port variations. In addition, we apply our pattern-based synthesis system to FPGA resource optimization with the observation that multiplexors are particularly expensive on FPGA platforms. Considering knowledge of discovered patterns, the resource binding step can intelligently generate the data-path to reduce interconnect costs. Experiments show our approach can, on average, reduce the total area by about 20% with 7 % latency overhead on the Xilinx Virtex-4 FPGAs, compared to the traditional behavior synthesis flow.
Analysis of Overlapped Code Division Multiple Access System in Gaussian Multiple Access Channel.

Privately Updating Suppression and Generalization based k%2DAnonymous Databases.

Similar Document Detection with Limited Information Disclosure.

Research on Methodology of Classification Mining for Tumor Markers.

Research on Methodology of Classification Mining for Tumor Markers.



Semantic event detection for consumer photo and video collections.

A Stochastic Game Theoretic Approach to Attack Prediction and Optimal Active Defense Strategy Decision.

Energy%2DSaving Service Scheduling for Low%2DEnd Cyber%2DPhysical Systems.

A Compression Framework for Personal Image Used in Mobile RFID System.

A Privacy%2DPreserving Framework for Integrating Person%2DSpecific Databases.

IBM Research TRECVID%2D2008 Video Retrieval System.
In this paper, we describe the IBM Research system for indexing, analysis, and retrieval of video as applied to the TREC-2008 video retrieval benchmark. This year, focus of the system improvement was on large-scale learning, cross-domain detection, and interactive search. A. High-level concept detection: 1. A ibm.Baseline 5: Baseline runs with randomsubspace bagging; 2. A ibm.BaseSSL 4: Fusion of baseline runs and principal component semi-supervised support vector machines(P CS 3 V M); 3. A ibm.BaseSSLText 3: Fusion of A ibm.BaseSSL 4 and text search results; 4. C ibm.CrossDomain 6: Learning on data from web domain; 5. C ibm.BNet 2: Multi-concept learning with baseline, P CS 3 V M and web concepts; 6. C ibm.BOR 1: Best overall runs by compiling the best models based on heldout performance for each concept. Overall, almost all the individual components can improve the mean average precision after fused with the baseline results. To summarize, we have the following observations from our evaluation results: 1) The baseline run using random-subspace bagging offers a reasonable starting performance with a more efficient learning process than standard SVMs; 2) By learning on both feature space and unlabeled data,

The exact solution and stability analysis for integral equation of third or first kind with singular kernel.

Adaptive CUSUM procedures with Markovian mean estimation.


Transforming semi%2Dhonest protocols to ensure accountability.

A Cryptographic Approach to Securely Share and Query Genomic Sequences.

An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems.
doi 10.1287/msom.1070.0167
PinKDD%2708 privacy%2C security%2C and trust in KDD post workshop report.
This report summarizes the events of the 2 nd International
A Game Theoretic Method for Decision and Analysis of the Optimal Active Defense Strategy.

Kernel Sharing With Joint Boosting For Multi%2DClass Concept Detection.

Identifying Rare Classes with Sparse Training Data.
Abstract. Building models and learning patterns from a collection of data are essential tasks for decision making and dissemination of knowledge. One of the common tools to extract knowledge is to build a classifier. However, when the training dataset is sparse, it is difficult to build an accurate classifier. This is especially true in biological science, as biological data are hard to produce and error-prone. Through empirical results, this paper shows challenges in building an accurate classifier with a sparse biological training dataset. Our findings indicate the inadequacies in well known classification techniques. Although certain clustering techniques, such as seeded k-Means, show some promise, there are still spaces for further improvement. In addition, we propose a novel idea that could be used to produce more balanced classifier when training data samples are very limited. 1
Synthesis of an application%2Dspecific soft multiprocessor system.
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high performance attributed to application-specific optimizations. However, designing an optimal application-specific multiprocessor system is still challenging because there are a number of important metrics, such as throughput, latency, and resource usage, that need to be explored and optimized. This paper addresses the problem of synthesizing the application-specific multiprocessor system to minimize latency and resource usage under the throughput constraint. We employ a novel framework for this problem, similar to that of technology mapping in the logic synthesis domain, and develop a set of efficient algorithms, including labeling, clustering and packing, for efficient generation of the multiprocessor architecture with application-specific optimized latency and resources. Specifically, the result of our algorithm is latency-optimal for directed acyclic task graphs. Application of our approach to the Motion JPEG example on Xilinx’s Virtex II Pro platform FPGA shows interesting design tradeoffs.
A Data Classifier Based on TOPSIS Method.

Skin Detection Using Color%2C Texture and Space Information.

Context%2DBased Concept Fusion with Boosted Conditional Random Fields.

Convolutional Multi%2DCode Multiplexing for OFDM Systems.

Secure Content Validation.

A Rate%2Ddistortion Based Quantization Level Adjustment Algorithm in Block%2Dbased Video Compression.

Rate%2Ddistortion Optimized Trellis%2DCoded Quantization.

Procuring Requirements for ERP Software Based on Semantic Similarity.

Research of Sludge Compost Maturity Degree Modeling Method Based on Wavelet Neural Network for Sewage Treatment.

Kodak%27s consumer video benchmark data set concept definition and annotation.
Semantic indexing of images and videos in the consumer domain has become a very important issue for both research and actual application. In this work we developed Kodak’s consumer video benchmark data set, which includes (1) a significant number of videos from actual users, (2) a rich lexicon that accommodates consumers ’ needs, and (3) the annotation of a subset of concepts over the entire video data set. To the best of our knowledge, this is the first systematic work in the consumer domain aimed at the definition of a large lexicon, construction of a large benchmark data set, and annotation of videos in a rigorous fashion. Such effort will have significant impact by providing a sound foundation for developing and evaluating large-scale learningbased semantic indexing/annotation techniques in the consumer domain. This report includes information about the concept definitions, the
Large%2Dscale multimodal semantic concept detection for consumer video.
In this paper we present a systematic study of automatic classification of consumer videos into a large set of diverse semantic concept classes, which have been carefully selected based on user studies and extensively annotated over 1300+ videos from real users. Our goals are to assess the state of the art of multimedia analytics (including both audio and visual analysis) in consumer video classification and to discover new research opportunities. We investigated several statistical approaches built upon global/local visual features, audio features, and audio-visual combinations. Three multi-modal fusion frameworks (ensemble, context fusion, and joint boosting) are also evaluated. Experiment results show that visual and audio models perform best for different sets of concepts. Both provide significant contributions to multimodal fusion, via expansion of the classifier pool for context fusion and the feature bases for feature sharing. The fused multimodal models are shown to significantly reduce the detection errors (compared to single modality models), resulting in a promising accuracy of 83 % over diverse concepts. To the best of our knowledge, this is the first work on systematic investigation of multimodal classification using a large-scale ontology and realistic video corpus.
AC%2DFramework for Privacy%2DPreserving Collaboration.
The secure mlllti-party compnt.ation (ShIC) illode1 provitles ineails for l~alailciilg the use and confidentiality of distribut.ed data. Iilcreasiilg security coilcerils 11al.e led to a surge in work oil practical secure 1nult.i-party coinputatioil protocols. However. inost are only proveil secure under the semi-hoilest model, and security under this adversary illode1 is iils~~fici~iit for illost applications. I11 this paper: we propose a no\rel frame~vork: accoui~tal~le coinputi~ig (XC) framework. ~17llicll is sufficient or practical for man!- applic.ations \vitlioiit the coinplesit,y and cost of a ShIC-protocol under the malicious model. F~lrtherinore. to sho ~ tlie a~)plical~ilit~- of t.1le AC-framework. we present an applicatioil under this framework regarding PI-i\-acy-preser\.iilg illillillg frequent it,emset,s.. 1
Protecting source privacy in federated search.

Columbia University TRECVID 2007 High%2DLevel Feature Extraction.

Block%2DBased Neural Networks for Personalized ECG Signal Classification.

A hybrid data mining anomaly detection technique in ad hoc networks.

An Improved Population Based Optimization Solution Method by Combining Local and Global Searching.

Universality and semicomputability for nondeterministic programming languages over abstract algebras.

Omnidirectional 3D reconstruction using rotating camera with mirrors.

Design of spreading codes with high diversity gain for multicarrier CDMA systems.

Robust Adjusted Likelihood Function for Image Analysis.

COSINE A Sketch%2DBased Interactive Environment for Cooperative Design.

A Framework for Sketch%2DBased Cooperative Design.

Panoramic 3D Reconstruction Using Rotational Stereo Camera with Simple Epipolar Constraints.

Behavior and communication co%2Doptimization for systems with sequential communication media.

Platform%2Dbased resource binding using a distributed register%2Dfile microarchitecture.
Behavior synthesis and optimization beyond the register transfer level require an efficient utilization of the underlying platform features. This paper presents a platform-based resource-binding approach using a distributed register-file microarchitecture (DRFM) that makes efficient use of distributed embedded memory blocks as register files in modern FPGAs. A DRFM contains multiple islands, each having a local register file, a functional unit pool and data-routing logic. Compared with the traditional discrete-register counterpart, a DRFM allows use of the platform-featured on-chip memory or register-file IP blocks to implement its local register files, and this results in substantial saving of multiplexing logic and global interconnects. DRFM provides a useful architectural template and a direct optimization objective for minimizing interisland connections for synthesis algorithms. Based on DRFM, we propose a novel binding algorithm focusing on the minimization of the inter-island connections. By applying our approach, significant reductions on multiplexors and global-interconnections are observed. On the Xilinx Virtex II FPGA platform, our experimental results show a 2X logic area reduction and a 7.8% performance improvement, compared with the traditional discrete-register-based approach.
Secure Distributed k%2DAnonymous Pattern Mining.

Transforming Semi%2DHonest Protocols to Ensure Accountability.


Prediction of Equipment Maintenance Using Optimized Support Vector Machine.


Analysis of Sib%2DPair IBD Profiles Using Ensemble Decision Tree Approach Application to Alcoholism.

Association Research on Potassium Channel Subtypes and Functional Sites.

Palmprint Recognition Based on 2%2DDimension PCA.

Active Context%2DBased Concept Fusionwith Partial User Labels.

Semi%2DSupervised Image Classification in Likelihood Space.

The Production Algorithm of Pseudo%2DRandom Number Generator Based on Compound Non%2DLinear Chaos System.

Continuous Heartbeat Monitoring Using Evolvable Block%2Dbased Neural Networks.

Palmprint Recognition Based on Improved 2DPCA.

A Gesture Model and Its Applications in Risk Assessment for Misrecognition.

Panoramic 3D Reconstruction by Fusing Color Intensity and Laser Range Data.

Similarity%2Dbased online feature selection in content%2Dbased image retrieval.
Content-based image retrieval (CBIR) has been more and more important in the last decade, and the gap between high-level semantic concepts and low-level visual features hinders further performance improvement. The problem of online feature selection is critical to really bridge this gap. In this paper, we investigate online feature selection in the relevance feedback learning process to improve the retrieval performance of the region-based image retrieval system. Our contributions are mainly in three areas. 1) A novel feature selection criterion is proposed, which is based on the psychological similarity between the positive and negative training sets. 2) An effective online feature selection algorithm is implemented in a boosting manner to select the most representative features for the current query concept and combine classifiers constructed over the selected features to retrieve images. 3) To apply the proposed feature selection method in region-based image retrieval systems, we propose a novel region-based representation to describe images in a uniform feature space with real-valued fuzzy features. Our system is suitable for online relevance feedback learning in CBIR by meeting the three requirements: learning with small size training set, the intrinsic asymmetry property of training samples, and the fast response requirement. Extensive experiments, including comparisons with many state-of-the-arts, show the effectiveness of our algorithm in improving the retrieval performance and saving the processing time. 
A secure distributed framework for achieving k%2Danonymity.
Abstract k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. Due to privacy issues, it is common that data from different sites cannot be shared directly. Therefore, this paper presents a two-party framework along with an application that generates k-anonymous data from two vertically partitioned sources without disclosing data from one site to the other. The framework is privacy preserving in the sense that it satisfies the secure definition commonly defined in the literature of Secure Multiparty Computation.
Mapping Low%2DLevel Features to High%2DLevel Semantic Concepts in Region%2DBased Image Retrieval.

Privacy%2DPreserving Distributed k%2DAnonymity.
Abstract. k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. This paper presents a k-anonymity protocol when the data is vertically partitioned between sites. A key contribution is a proof that the protocol preserves k-anonymity between the sites: While one site may have individually identifiable data, it learns nothing that violates k-anonymity with respect to the data at the other site. This is a fundamentally different distributed privacy definition than that of Secure Multiparty Computation, and it provides a better match with both ethical and legal views of privacy.
Large%2DScale Ensemble Decision Analysis of Sib%2DPair IBD Profiles for Identification of the Relevant Molecular Signatures for Alcoholism.

A Novel Ensemble Decision Tree Approach for Mining Genes Coding Ion Channels for Cardiopathy Subtype.

Knowledge Discovery from Transportation Network Data.
Transportation and Logistics are a major sector of the economy, however data analysis in this domain has remained largely in the province of optimization. The potential of data mining and knowledge discovery techniques is largely untapped. Transportation networks are naturally represented as graphs. This paper explores the problems in mining of transportation network graphs: We hope to find how current techniques both succeed and fail on this problem, and from the failures, we hope to present new challenges for data mining. Experimental results from applying both existing graph mining and conventional data mining techniques to real transportation network data are provided, including new approaches to making these techniques applicable to the problems. Reasons why these techniques are not appropriate are discussed. We also suggest several challenging problems to precipitate research and galvanize future work in this area. 1
E%2Dprocurement and market evolution an evolutionary game approach.

Adaptive Online Multi%2Dstroke Sketch Recognition Based on Hidden Markov Model.

Hidden annotation for image retrieval with long%2Dterm relevance feedback learning.

Multi%2Dlayer semantic representation learning for image retrieval.

Online feature selection based on generalized feature contrast model.

Relevance feedback using random subspace method.

Reverse Engineering of Multiple Time%2Ddelayed Gene Regulatory Networks.

Feature Gene Selection Based on a Hybrid between Genetic Algorithm and Support Vector Machine.

On%2Dline outlier detection and data cleaning.

